منابع مشابه
Reordered gossip schemes
This paper presents a new theorem called the reordering theorem for the problem of gossiping by telephone. The theorem says the calls of any complete gossiping can be rearranged into a sequence such that at most two calls cause each participant to become fully informed, and such that the reverse of this sequence has the same property. This theorem has broad consequences. Several results from th...
متن کاملRepresentations of Gossip Schemes
Formalisms for representing gossip problems are surveyed. A new method \calling schemes" is presented which generalizes existing methods. This survey is intended to serve primarily as a basis for future work.
متن کاملLsign Reordered Lsign Reordered
LSign 18] is an elegant domain for analyzing constraint logic programming languages over linear real constraints. Its key conceptual ideas are the abstraction of linear constraints by replacing coeecients by their signs and the use of annotations for preserving multiplicity information on the constraints. Unfortunately, the ordering of abstract constraint stores given in 18] does not capture th...
متن کاملKernels of minimum size gossip schemes
The main part of gossip schemes are the kernels of their minimal orders. We give a complete characterization of all kernels that may appear in gossip schemes on simple graphs with a minimum number of calls. As consequences we prove several results on gossip schemes, e.g. the minimum number of rounds of a gossip scheme with a minimum number of calls is computed. Moreover, in the new context we g...
متن کاملGOSSIP: Gossip Over Storage Systems Is Practical
Gossip-based mechanisms are touted for their simplicity, limited resource usage, robustness to failures, and tunable system behavior. These qualities make gossiping an ideal mechanism for storage systems that are responsible for maintaining and updating data in a mist of failures and limited resources (e.g., intermittent network connectivity, limited bandwidth, constrained communication range, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00302-y